#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int n,a[N],x,g[N],m,ans,see[N];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin >> n;
    for (int i = 1;i <= N;i++) a[i] = 0;
    for (int i = 1;i <= n;i++) {
        cin >> x;
        a[x] ++;
        see[x] = i;
    }
    for (int i = 1;i < N;i++) {
       if (a[i] > 0) {
            g[++m] = a[i];
       }
    }
    for (int i = 1;i <= m-1;i++) {
        if (g[i] > g[i+1]) g[i+1] = g[i];
    }
    ans += g[m];
    cout << ans;
    return 0;
}
